Suggestion Strategies for Constraint - BasedMatchmaker Agents ? ? Eugene

نویسندگان

  • Eugene C. Freuder
  • Richard J. Wallace
چکیده

In this paper we describe a paradigm for content-focused matchmaking, based on a recently proposed model for constraint acquisition and satisfaction. Matchmaking agents are conceived as constraint-based solvers that interact with other, possibly human, agents (Customers). The Matchmaker provides potential solutions (\suggestions") based on partial knowledge, while gaining further information about the problem itself from the other agent through the latter's evaluation of these suggestions. The dialog between Matchmaker and Customer results in iterative improvement of solution quality, as demonstrated in simple simulations. We also show empirically that this paradigm supports \sug-gestion strategies" for nding acceptable solutions more eeciently or for increasing the amount of information obtained from the Customer. This work also indicates some ways in which the tradeoo between these two metrics for evaluating performance can be handled.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint-Based Strategies for Matchmakers

We describe a paradigm for content-focused matchmaking, based on a recently proposed model for constraint acquisition-and-satisfaction. Matchmaking agents are conceived as constraint-based solvers that interact with other, possibly human, agents (Customers). The Matchmaker provides potential solutions ("suggestions") based on partial knowledge, while gaining further information about the proble...

متن کامل

Suggestion Strategies for Constraint-Based Matchmaker Agents

In this paper we describe a paradigm for contentfocused matchmaking, based on a recently proposed model for constraint acquisition-and-satisfaction. Matchmaking agents are conceived as constraintbased solvers that interact with other, possibly human, agents (Clients or Customers). The Matchmaker provides potentiM solutions ("suggestions") based on partial knowledge, while gaining further inform...

متن کامل

Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction

A team of constraint agents with diverse viewpoints can find a solution to a constraint satisfaction problem (CSP) when the individual agents have an incomplete view of the problem. In this paper we present a method of solving constraint satisfaction problems (CSPs) using cooperating constraint agents where each agent has a different representation of a particular CSP. Agents assist one another...

متن کامل

Using CBR to Select Solution Strategies in Constraint Programming

Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes resources and may result in a problem going unsolved. We show how Case-Based Reasoning can be used to select good strategies. We design experiments which demonstrate that, on two problems with quite different characteris...

متن کامل

Constraints and Agents Confronting Ignorance

the intersection of the communities studying constraint computation and software agents. Constraint-based reasoning systems can be enhanced by using agents with multiple problem-solving approaches or diverse problem representations. The constraint computation paradigm can be used to model agent consultation, cooperation, and competition. An interesting theme in agent interaction, which is studi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998